A simple kinetic visibility polygon
نویسندگان
چکیده
! " # %$& (') * + , -. ('0/ '1 2 3 %$4 52 /6 3 % & 4 7 89 & : ;< %$& = : > >;2'1 ; ? @ A CB*'1 = = : ;D E< -+'1 4 GFIH J K & = :5L /< = %$9 = 3 %$ M = 4 ON ,P 052 = ') ; M!'1 ; ? 0 Q ? = ? ! F Categories and Subject Descriptors R S TLS TJU V WYX1Z&[K\9Z0]_^_Z)`#acbed f4d g%Z)hji kmlmn0oKp*q1rOs*r(tKuvl p*w tKx=s*y=z4{3r oKn0|9}~x=t &p* { t {34p* 1s*yGqL 0M: & 3 / : = ? / %$ J 05
منابع مشابه
Visibility Queries in Simple Polygons and Applications
In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P . We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubi...
متن کاملVisibility Queries and Maintenance in Simple Polygons
In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P . We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubi...
متن کاملDynamic algorithms for visibility polygons
We devise dynamic algorithms for the following (weak) visibility polygon computation problems: • Maintaining visibility polygon of a fixed point located interior to simple polygon amid vertex insertions and deletions to simple polygon. • Answering visibility polygon query corresponding to any point located exterior to simple polygon amid vertex insertions and deletions to simple polygon. • Main...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملVisibility Graph: A Simple Proof of Staircase Equivalence of Polygons
In this paper we present a very simple proof of the following result due to Abello et al [5], concerning the visibility graphs of simple polygons. The result says that the visibility graph of any simple nondegenerate polygon is isomorphic to the visibility graph of some simple staircase polygon. As a result of the above proof we also give an O(n log n) time algorithm for the following problem: ...
متن کامل